MODELING ADVERTISING CARRYOVER IN FLUID MILK: COMPARISON OF ALTERNATIVE LAG SPECIFICATIONS

The performance of restricted estimators such as Almon and Shiller in modeling advertising carryover is tested and compared to the unrestricted OLS estimator, using 1971-1988 monthly New York City fluid milk market data. Results indicate that in the absence of autocorrelation and multicollinearity among the lagged advertising variables, the unrestricted OLS estimator is still the preferred estimator, based on Mean Square Error and Root Mean Square Percent Error criteria. In this case, the Almon and Shiller estimators perform equally well, although next only to the OLS estimator. In the presence of autocorrelation or multicollinearity however, the restricted estimators may outperform the OLS estimator, in a MSE sense, with the flexible Shiller estimator (which subsumes the Almon) being more desirable.Marketing,

The Denying of Death: A Social Psychological Study

Cultural studies indicate the existence of a ubiquitous death fear This fear is usually manifest through the defense mechanism of denial. In American society, the contradiction between life-oriented cultural themes and the death theme intensifies the denial of death. Past studies indicate that a host of social and psychological variables are associated with death denial. The present study consisted of a survey of death attitudes. The results showed that death denial is associated with age, marital status, death of a parent, feeling of nervousness, and participation in dangerous activities. On the other hand. sex, health, and religious activity were not found associated with death denial

Compiling Quantum Programs

This thesis introduces the quantum compilation problem and develops a prototypical compiler. The problem of quantum compiling is, in essence, converting high-level human expressions of quantum programs into low-level hardware executable code. Compilers that target different hardware platforms enable portable code that can be used to benchmark hardware performance, reduce programming work and speed up development. Because quantum systems are subjected to phenomena such as noise, no-cloning and decoherence, the challenge of quantum compiling is tied to the optimization of program runtimes and the lengths of compiled sequences. For near-term intermediate scale quantum (NISQ) computers with limited hardware resources and without error correction, a well-designed compiler that optimizes hardware usage and circuit fidelity is necessary to running applications and tests. To give an introduction to the problem of quantum compiling, this thesis reviews the universality proof for quantum computation and the Solovay-Kitaev theorem, which are both foundational to the topic. A compilation scheme with two components, one following the universality proof and one inspired by the Solovay-Kitaev theorem, is implemented to demonstrate an approach that solves the quantum compiling problem. Finally, I survey state-of-the-art compilation techniques and discuss how to extend this thesis toward building a practical compiler that will be a part of the broader software stack

Some Findings Concerning the Self-Concept of Black Americans

A report submitted by Henry H. B. Chang to the Faculty Research Committee in November of 1973 on the favorable self-concept of African-Americans in the past and present (1970s)

Attitudes of Chinese Students in the United States

An article by Henry H. B. Chang published in October of 1973 by Sociology and Social Research, pages 66-77

QoS-Aware Middleware for Web Services Composition

The paradigmatic shift from a Web of manual interactions to a Web of programmatic interactions driven by Web services is creating unprecedented opportunities for the formation of online Business-to-Business (B2B) collaborations. In particular, the creation of value-added services by composition of existing ones is gaining a significant momentum. Since many available Web services provide overlapping or identical functionality, albeit with different Quality of Service (QoS), a choice needs to be made to determine which services are to participate in a given composite service. This paper presents a middleware platform which addresses the issue of selecting Web services for the purpose of their composition in a way that maximizes user satisfaction expressed as utility functions over QoS attributes, while satisfying the constraints set by the user and by the structure of the composite service. Two selection approaches are described and compared: one based on local (task-level) selection of services and the other based on global allocation of tasks to services using integer programming